Hardware Assist for Constrained Circle Constructions II: Cluster Merging Problems
نویسندگان
چکیده
In geometric constraint solving, constructing circles with indeterminate radius is an important sub problem. Such constructions are both sequential, meaning that we seek a circle tangent to three known geometric entities, as well as simultaneous, when several sets of entities, among them variable-radius circles, must be determined together. In Part I of our investigation, we considered sequential constructions in which a single circle had to be constructed from required tangencies to known geometric entities. In Part II, we develop hardware-assisted techniques to solve the simultaneous construction problems of variable-radius circles. We utilize the graphics hardware to determine the solutions. For Part I, this could be accomplished relying fundamentally on constructing distance maps. Here, we need to construct and sample surfaces from configuration space.
منابع مشابه
Hardware Assistance for Constrained Circle Constructions II: Cluster Merging Problems
In geometric constraint solving, constructing circles with indeterminate radius is an important sub problem. Such constructions are both sequential, meaning that we seek a circle tangent to three known geometric entities, as well as simultaneous, when several sets of entities, among them variable-radius circles, must be determined together. In Part I of our investigation, we considered sequenti...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملOptimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...
متن کاملOn Tree Decomposability of Henneberg Graphs
In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the treedecomposition constructive technique. The algorithm is based on Henneberg constructions and would be of help in transforming underconstrained problems into well constrained problems as well as in exploring alternative constructions over a given set of geometric elements.
متن کاملMerging Constrained Optimisation with Deterministic Annealing to Solve Combinatorially Hard Problems
Several parallel analogue algorithms, based upon mean field theory (MFT) approximations to an underlying statistical mechanics formulation, and requiring an externally prescribed annealing schedule, now exist for finding approximate solutions to difficult combinatorial optimisation problems. They have been applied to the Travelling Salesman Problem (TSP), as well as to various issues in computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009